-graph - definitie. Wat is -graph
Diclib.com
Woordenboek ChatGPT
Voer een woord of zin in in een taal naar keuze 👆
Taal:

Vertaling en analyse van woorden door kunstmatige intelligentie ChatGPT

Op deze pagina kunt u een gedetailleerde analyse krijgen van een woord of zin, geproduceerd met behulp van de beste kunstmatige intelligentietechnologie tot nu toe:

  • hoe het woord wordt gebruikt
  • gebruiksfrequentie
  • het wordt vaker gebruikt in mondelinge of schriftelijke toespraken
  • opties voor woordvertaling
  • Gebruiksvoorbeelden (meerdere zinnen met vertaling)
  • etymologie

Wat (wie) is -graph - definitie

GRAPH
Turan graph; Cocktail party graph; Octahedral Graph; Octahedral graph
  • The [[octahedron]], a 3-[[cross polytope]] whose edges and vertices form ''K''<sub>2,2,2</sub>, a Turán graph ''T''(6,3). Unconnected vertices are given the same color in this face-centered projection.

-graph      
¦ combining form
1. in nouns denoting something written or drawn in a specified way: autograph.
2. in nouns denoting a recording instrument: seismograph.
Origin
from Fr. -graphe, based on Gk graphos 'written, writing'.
Null graph         
GRAPH WITHOUT EDGES (ON ANY NUMBER OF VERTICES)
Empty tree; Empty graph; Null Graph; Null tree; Singleton graph; Edgeless graph; Order-zero graph
In the mathematical field of graph theory, the term "null graph" may refer either to the order-zero graph, or alternatively, to any edgeless graph (the latter is sometimes called an "empty graph").
Turán graph         
The Turán graph, denoted by T(n,r), is a complete multipartite graph; it is formed by partitioning a set of n vertices into r subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Where q and s are the quotient and remainder of dividing n by r (so n = qr + s), the graph is of the form K_{q+1, q+1, \ldots, q, q}, and the number of edges is

Wikipedia

Turán graph

The Turán graph, denoted by T ( n , r ) {\displaystyle T(n,r)} , is a complete multipartite graph; it is formed by partitioning a set of n {\displaystyle n} vertices into r {\displaystyle r} subsets, with sizes as equal as possible, and then connecting two vertices by an edge if and only if they belong to different subsets. Where q {\displaystyle q} and s {\displaystyle s} are the quotient and remainder of dividing n {\displaystyle n} by r {\displaystyle r} (so n = q r + s {\displaystyle n=qr+s} ), the graph is of the form K q + 1 , q + 1 , , q , q {\displaystyle K_{q+1,q+1,\ldots ,q,q}} , and the number of edges is

( 1 1 r ) n 2 s 2 2 + ( s 2 ) {\displaystyle \left(1-{\frac {1}{r}}\right){\frac {n^{2}-s^{2}}{2}}+{s \choose 2}} .

The graph has s {\displaystyle s} subsets of size q + 1 {\displaystyle q+1} , and r s {\displaystyle r-s} subsets of size q {\displaystyle q} ; each vertex has degree n q 1 {\displaystyle n-q-1} or n q {\displaystyle n-q} . It is a regular graph if n {\displaystyle n} is divisible by r {\displaystyle r} (i.e. when s = 0 {\displaystyle s=0} ).

Voorbeelden uit tekstcorpus voor -graph
1. But note the relationship shown in the first graph.
2. Karan: I was talking to Anil about his career graph.
3. You‘re gay!‘ Charming: and another fluctuation on the graph.
4. But demand is already surging, as the graph shows.
5. The graph suggests the rest would arrive by 2.15pm.